Order-sorted equality enrichments modulo axioms
نویسندگان
چکیده
منابع مشابه
Order-Sorted Equality Enrichments Modulo Axioms
Built-in equality and inequality predicates based on comparison of canonical forms in algebraic specifications are frequently used because they are handy and efficient. However, their use places algebraic specifications with initial algebra semantics beyond the pale of theorem proving tools based, for example, on explicit or inductionless induction techniques, and of other formal tools for chec...
متن کاملPartial Evaluation of Order-Sorted Equational Programs Modulo Axioms
Partial evaluation (PE) is a powerful and general program optimization technique with many successful applications. However, it has never been investigated in the context of expressive rule-based languages like Maude, CafeOBJ, OBJ, ASF+SDF, and ELAN, which support: 1) rich type structures with sorts, subsorts and overloading; 2) equational rewriting modulo axioms such as commutativity, associat...
متن کاملStrict coherence of conditional rewriting modulo axioms
Conditional rewriting modulo axioms with rich types makes specifications and declarative programs very expressive and succinct and is used in all well-known rule-based languages. However, the current foundations of rewriting modulo axioms have focused for the most part on the unconditional and untyped case. The main purpose of this work is to generalize the foundations of rewriting modulo axiom...
متن کاملData Structure Specifications via Local Equality Axioms
We describe a program verification methodology for specifying global shape properties of data structures by means of axioms involving predicates on scalar fields, pointer equalities, and pointer disequalities, in the neighborhood of a memory cell. We show that such local invariants are both natural and sufficient for describing a large class of data structures. We describe a complete decision p...
متن کاملHigher-Order Order-Sorted Resolution
The introduction of sorts to rst-order automated deduction has brought greater conciseness of representation and a considerable gain in eeciency by reducing the search space. It is therefore promising to treat sorts in higher order theorem proving as well. In this paper we present a generalization of Huet's Constrained Resolution to an order-sorted type theory T with term declarations. This sys...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Science of Computer Programming
سال: 2015
ISSN: 0167-6423
DOI: 10.1016/j.scico.2014.07.003